On Self-stabilizing Systems " By
نویسنده
چکیده
منابع مشابه
On Self-stabilizing Systems: an Approach to the Speciication and Design of Fault Tolerant Systems
A self-stabilizing system is one which can recover from transient faults in a nite number of steps. We present a theory for determining if a behavior speciication can be satissed with a self-stabilizing system and if not, then what the largest self-stabilizing subset and smallest self-stabilizing superset of the speciication is. The eeects of self-stabilizing behavior on the control of discrete...
متن کاملSafe and Eventually Safe: Comparing Self-stabilizing and Non-stabilizing Algorithms on a Common Ground
Self-stabilizing systems can be started in any arbitrary state and converge to exhibit the desired behavior. However, self-stabilizing systems can be started in predefined initial states, in the same way as non-stabilizing systems. In this case, a self-stabilizing system can mask faults just like any other distributed system. Moreover, whenever faults overwhelm the systems beyond their capabili...
متن کاملSelf-stabilization of Byzantine Protocols
Awareness of the need for robustness in distributed systems increases as distributed systems become integral parts of day-to-day systems. Self-stabilizing while tolerating ongoing Byzantine faults are wishful properties of a distributed system. Many distributed tasks (e.g. clock synchronization) possess e cient non-stabilizing solutions tolerating Byzantine faults or conversely non-Byzantine bu...
متن کاملMechanical Verification of Self-Stabilizing Distributed Systems
Self-stabilizing distributed systems are a class of distributed systems which converge to correct system states even if they start from arbitrary system states. A self-stabilizing system can recover from finite number of transient faults (e.g., message loss, memory corruption). Therefore, they are fault-tolerant systems. When we design a self-stabilizing system, its verification, such as conver...
متن کاملQuasi-self-stabilization of a distributed system assuming read/write atomicity
Self-stabilizing systems of the Dolev type were first introduced by Dolev et al. in their famous paper in 1993. In contrast to self-stabilizing systems of the Dijkstra type, such self-stabilizing systems assume the read/write atomicity model instead of the composite atomicity model. In this paper, we introduce the notion of quasi-self-stabilizing systems of the Dolev type. A naturally-adapted v...
متن کاملSelf-stabilizing Virtual Synchrony
Virtual synchrony (VS) is an important abstraction that is proven to be extremely useful when implemented over asynchronous, typically large, message-passing distributed systems. Fault tolerant design is critical for the success of such implementations since large distributed systems can be highly available as long as they do not depend on the full operational status of every system participant...
متن کامل